An Adaptable (n, n) Secret Image Sharing Mechanism Based on Boolean Operation
نویسندگان
چکیده
Secret image sharing, as an extension of secret sharing, has attracted the attention of many scholars in recent years. Multi-secret image sharing is an extension of traditional secret image sharing in which only one secret image can be shared among one group. In order to extend the utility of the mechanism, we propose an innovative (n, n) secret image sharing scheme based on matrix transformation. Due to the skillful design of the matrix operation used in matrix transformation, the proposed scheme is applicable to more than one secret image. Further, more secret images and participants can be included in this sharing system even after the secret image sharing procedure has been constructed. Also, the proposed scheme produces highquality shadow images, and it can reconstruct the secret images losslessly. Moreover, the computational complexity of the proposed scheme is minimized by only using the XOR operation, which stands for exclusive or and is a logical operation that outputs true whenever both inputs differ. The experimental results demonstrated that the proposed scheme provides the aforementioned advantages.
منابع مشابه
Improving Contrast in Random Grids Based Visual Secret Sharing
In the existing random grids based (n, n) visual secret sharing (VSS) schemes, decryption is done with the help of human visual system by stacking the cipher grids. The stacking operation is computationally modeled as Boolean OR operation, which suffers from two drawbacks. Firstly, the contrast of the reconstructed image decreases exponentially by increasing n (≥2) and secondly, it requires per...
متن کاملThreshold visual secret sharing based on Boolean operations
We design a new (k,n)-threshold visual secret sharing scheme on the basis of Boolean operations. We propose two different algorithms to encrypt a secret image into n meaningless shares such that no secret information can be obtained by having any k 1 or fewer shares. However, the secret image can be reconstructed easily by XOR of any k (≤n) or more shares. Both the algorithms have used simple B...
متن کاملThreshold Visual Secret Sharing Based on Boolean Operations and Random Grids
We design a new (k,n)-threshold visual secret sharing scheme on the basis of Boolean operations. We propose two different algorithms to encrypt a secret image into n meaningless shares such that no secret information can be obtained by having any k 1 or fewer shares. However, the secret image can be reconstructed easily by XOR of any k (≤n) or more shares. Both the algorithms have used simple B...
متن کاملNonlinear Secret Image Sharing Scheme
Over the past decade, most of secret image sharing schemes have been proposed by using Shamir's technique. It is based on a linear combination polynomial arithmetic. Although Shamir's technique based secret image sharing schemes are efficient and scalable for various environments, there exists a security threat such as Tompa-Woll attack. Renvall and Ding proposed a new secret sharing technique ...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Network Security
دوره 16 شماره
صفحات -
تاریخ انتشار 2014